An Unassailable Block Cipher Generation with an Extended PCC, Concerning a Large Alphanumeric Kay, Modular Arithmetic and Integral Functions
نویسنده
چکیده
In this investigation, we have developed an unbreakable block cipher with extended play color cipher algorithm. This includes multiple transpositions, substitutions, modular arithmetic, integral functions and a 32 characters alphanumeric key. These functions mutate the plain text in various ways before it takes the shape of cipher text. The process of encryption, decryption and the sub key generation method were explained with example. The avalanche effect and the cryptanalysis examined in this analysis clearly indicate that the cipher is very strong one. General Terms Crypt analysis, Block cipher, Play color cipher, Encryption, Decryption, Decillions, Security and Algorithm.
منابع مشابه
$C$-class functions on common fixed point theorems for weak contraction mapping of integral type in modular spaces
In this paper, we use the concept of $C$-class functions introduced by Ansari [4] to prove the existence and uniqueness of common fixed point for self-mappings in modular spaces of integral inequality. Our results extended and generalized previous known results in this direction.
متن کاملA Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix
In this paper, we have developed a block cipher for blocks of size 196 bits and 392 bits. In this, we have represented the plaintext in the form of a matrix of size 28 x 7, consisting of binary bits. The key matrix is represented in the form of a matrix of size 28 x 28, and it comprises binary bits. In the process of decryption, we have used the modular arithmetic inverse (K) of the key matrix ...
متن کاملAn Attack on Two Hash Functions by Zheng-Matsumoto-Imai
In [ZMI89,ZMI90] two constructions for a collision resistant hash function were proposed. The first scheme is based on a block cipher, and the second scheme uses modular arithmetic. It is shown in this paper that both proposals have serious weaknesses.
متن کاملHash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is approximately equal to the block length. A general model is presented, and it is shown that this model covers 9 schemes that have appeared in the literature. Within this general model 64 possible schemes exist, and it is s...
متن کاملA New Framework for Scalable Secure Block Cipher Generation using Color Substitution and Permutation on Characters, Numbers, Images and Diagrams
The aim of our research is to develop a new framework for secure block cipher generation using color substitution and permutations on alphanumeric letters, symbols, images, diagrams or any kind of text. To transfer the keys from source to destination we have used RSA public key algorithm and for encryption / decryption of the information, we have used our invented „play color substitution‟ algo...
متن کامل